Factor Automata and Special Factors
نویسنده
چکیده
The factor automaton of a finite word w is the minimal deterministic automaton recognizing the set of factors of w. It is a data structure allowing the search of a pattern in a text in time and space proportional to the length of the pattern. In this paper we link classical combinatorial parameters on words to the size and the structure of the factor automaton. As a main result, we give a characterization of the words having factor automaton with minimal number of states.
منابع مشابه
Special factors and the combinatorics of suffix and factor automata
The suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata.We also characteri...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملEvaluating Response Modification Factors of Concentrically Braced and Special Moment Steel Frames in Duplex Buildings
Response modification factor (R-factor) is one of the seismic design parameters to consider nonlinear performance of building structures during strong earthquake. Relying on this, many seismic design codes led to reduce earthquake loads imposed to the structure. The present paper tries to evaluate the R-factors of conventional concentric braced frames (CBFs) and special moment frames (MRFs) in ...
متن کاملFast Cellular Automata Implementation on Graphic Processor Unit (GPU) for Salt and Pepper Noise Removal
Noise removal operation is commonly applied as pre-processing step before subsequent image processing tasks due to the occurrence of noise during acquisition or transmission process. A common problem in imaging systems by using CMOS or CCD sensors is appearance of the salt and pepper noise. This paper presents Cellular Automata (CA) framework for noise removal of distorted image by the salt an...
متن کاملMoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
The limiting factor for quantitative analysis of Markov decision processes (MDP) against specifications given in linear temporal logic (LTL) is the size of the generated product. As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms. We present an extension of PRISM for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010